Truncated Hierarchical Preconditioning for the Stochastic Galerkin Fem
نویسندگان
چکیده
Stochastic Galerkin finite element discretizations of partial differential equations with coefficients characterized by arbitrary distributions lead, in general, to fully block dense linear systems. We propose two novel strategies for constructing preconditioners for these systems to be used with Krylov subspace iterative solvers. In particular, we present a variation of the hierarchical Schur complement preconditioner, developed recently by the authors, and an adaptation of the symmetric block Gauss-Seidel method. Both preconditioners take advantage of the hierarchical structure of global stochastic Galerkin matrices, and also, when applicable, of the decay of the norms of the stiffness matrices obtained from the polynomial chaos expansion of the coefficients. This decay allows to truncate the matrix-vector multiplications in the action of the preconditioners. Also, throughout the global matrix hierarchy, we approximate solves with certain submatrices by the associated diagonal block solves. The preconditioners thus require only a limited number of stiffness matrices obtained from the polynomial chaos expansion of the coefficients, and a preconditioner for the diagonal blocks of the global matrix. The performance is illustrated by numerical experiments.
منابع مشابه
Efficient Iterative Solvers for Stochastic Galerkin Discretizations of Log-Transformed Random Diffusion Problems
We consider the numerical solution of a steady-state diffusion problem where the diffusion coefficient is the exponent of a random field. The standard stochastic Galerkin formulation of this problem is computationally demanding because of the nonlinear structure of the uncertain component of it. We consider a reformulated version of this problem as a stochastic convection-diffusion problem with...
متن کاملAdaptive stochastic Galerkin FEM with hierarchical tensor representations
The solution of PDE with stochastic data commonly leads to very high-dimensional algebraic problems, e.g. when multiplicative noise is present. The Stochastic Galerkin FEM considered in this paper then suffers from the curse of dimensionality. This is directly related to the number of random variables required for an adequate representation of the random fields included in the PDE. With the pre...
متن کاملIterative Solvers for the Stochastic Finite Element Method
This paper presents an overview and comparison of iterative solvers for linear stochastic partial differential equations (PDEs). A stochastic Galerkin finite element discretization is applied to transform the PDE into a coupled set of deterministic PDEs. Specialized solvers are required to solve the very high-dimensional systems that result after a finite element discretization of the resulting...
متن کاملPreconditioning of symmetric interior penalty discontinuous Galerkin FEM for elliptic problems∗
This is a further development of [10] regarding multilevel preconditioning for symmetric interior penalty discontinuous Galerkin finite element approximations of second order elliptic problems. We assume that the mesh on the finest level is a results of a geometrically refined fixed coarse mesh. The preconditioner is a multilevel method that uses a sequence of finite element spaces of either co...
متن کاملEfficient Preconditioning of hp-FEM Matrices by Hierarchical Low-Rank Approximations
In this talk I will introduce a preconditioner based on low-rank compression of Schur complements. The construction is inspired by the well-known nested dissection strategy, and relies on the assumption that the Schur complements that arise in the elimination process can be approximated, to high precision, by compressible matrices. The preconditioner is built as an approximate LDM t factorizati...
متن کامل